Inner Palindromic Closure
نویسندگان
چکیده
We introduce the inner palindromic closure as a new operation ♠, which consists in expanding a factor u to the left or right by v such that vu or uv, respectively, is a palindrome of minimal length. We investigate several language theoretic properties of the iterated inner palindromic closure ♠∗(w) = ⋃ i≥0 ♠ (w) of a word w.
منابع مشابه
Pseudopalindrome closure operators in free monoids
We consider involutory antimorphisms θ of a free monoid A∗ and their fixed points, called θ-palindromes or pseudopalindromes. A θ-palindrome reduces to a usual palindrome when θ is the reversal operator. For any word w ∈ A∗ the right (resp. left) θ-palindrome closure of w is the shortest θ-palindrome having w as a prefix (resp. suffix). We prove some results relating θ-palindrome closure operat...
متن کاملPalindromic and Sūdoku Quasigroups
Two quasigroup identities of importance in combinatorics, Schroeder’s Second Law and Stein’s Third Law, share many common features that are incorporated under the guise of palindromic quasigroups. A graph-theoretical technique yields a topological proof for the congruence restrictions on the spectrum of Schroeder or outer palindromic quasigroups. The potential for a comparable proof applicable ...
متن کاملA palindromization map for the free group
We define a self-map Pal : F2 → F2 of the free group on two generators a, b, using automorphisms of F2 that form a group isomorphic to the braid group B3. The map Pal restricts to de Luca’s right iterated palindromic closure on the submonoid generated by a, b. We show that Pal is continuous for the profinite topology on F2; it is the unique continuous extension of de Luca’s right iterated palin...
متن کاملOn the fixed points of the iterated pseudopalindromic closure operator
First introduced in the study of the Sturmian words, the iterated palindromic closure was generalized to pseudopalindromes. This operator allows one to construct words with infinitely many pseudopalindromic prefixes, called pseudostandard words. We provide here several combinatorial properties of the fixed points under the iterated pseudopalindromic closure.
متن کاملOn Periodicity and Complexity of Generalized Pseudostandard Words
Generalized pseudostandard words have been introduced by de Luca and De Luca in [7]. In comparison to the palindromic and pseudopalindromic closure, only little is known about the generalized pseudopalindromic closure and the associated generalized pseudostandard words. We present two new results concerning these words. The first one is a necessary and sufficient condition for their periodicity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 25 شماره
صفحات -
تاریخ انتشار 2013